Representing Large Scale Space - A Computational Theory of Cognitive Maps
نویسندگان
چکیده
We present a computational theory of cognitive maps which proposes that the cognitive map, a representation for a viewer’s experience of their spatial environment, comprises two loosely coupled modules, the raw cognitive map and the full cognitive map. The raw map is a representation for the spatial arrangement and physical characteristics of surfaces. The various interpretations (or conceptualisations) that are derived from the raw map form the full map. The cognitive map is built from the bottom up, starting with the sensory input. A representation termed an Absolute Space Representation (ASR) is computed for each local space visited and these ASRs connected in the way they are experienced are the raw map. We discuss the current status of our work on computing a cognitive map and in particular present a new algorithm for computing an ASR.
منابع مشابه
Exploiting Local Perceptual Models for Topological Map-Building∗
The Spatial Semantic Hierarchy (SSH) provides a robot-independent ontology and logical theory for building topological maps of large-scale environments online. Existing SSH implementations make very limited use of perceptual information and thus create many candidate maps. Metrical mapping implementations capture detailed knowledge about local small-scale space but do not handle large environme...
متن کاملMaps beyond Diagrams: Real-World Spatial Orientation
Cognitive models of orientation using aerial-view 2D diagrams such as maps could help us to predict where their contents and design help, or hinder, cognitive processes, resulting in more usable map designs for situations where orientation is a common problem. However, the complex realities of geographic space, and the large scale transformations required with maps, make it less easy to model e...
متن کاملParallel Genetic Learning of Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs), which were introduced by Bart Kosko in 1986, are a powerful modeling technique for dynamic systems. Recently introduced automated learning method, based on real-coded genetic algorithm (RCGA), allows for establishing high-quality FCMs from historical data. The current bottleneck of this method is its scalability, which originates from large continuous search space a...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملCognitive model exploration and optimization: a new challenge for computational science
Parameter space exploration is a common problem tackled on large-scale computational resources. The most common technique, a full combinatorial mesh, is robust but scales poorly to the computational demands of complex models with higher dimensional spaces such as those found in the cognitive and behavioral modeling community. To curtail the computational requirements, I have implemented two par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002